Genome-wide association for major depressive disorder: a possible role for the presynaptic protein piccolo

Major depressive disorder (MDD) is a common complex trait with enormous public health significance. As part of the Genetic Association Information Network initiative of the US Foundation for the National Institutes of Health, we conducted a genome-wide association study of 435 291 single nucleotide polymorphisms (SNPs) genotyped in 1738 MDD cases and 1802 controls selected to be at low liability for MDD. Of the top 200, 11 signals localized to a 167 kb region overlapping the gene piccolo (PCLO, whose protein product localizes to the cytomatrix of the presynaptic active zone and is important in monoaminergic neurotransmission in the brain) with P-values of 7.7 × 1

Nested collections and polytypism

A point-free calculus of so-called ''collection types'' is presented, similar to the monadic calculus of http://www.cis.upenn.edu/~db/home.html. We observe that our calculus is parametrised by a monad thus making the calculus ''polytypic''. A novel contribution of the paper is to discuss situations in which a single application involves more than one collection type. In particular, we outline the contribution to database research that may be obtained by exploiting current developments in polytypic programming

Relational programming laws in the tree, list, bag, set hierarchy

In this paper we demonstrate that the basic rules and calculational techniques used in two extensively documented program derivation methods can be expressed, and, indeed, can be generalized within a relational theory of datatypes. The two methods to which we refer are the so-called "Bird-Meertens formalism" for the construction of functional programs and the "Dijkstra-Feijen calculus" for the construction of imperative programs

Bag Equivalence via a Proof-Relevant Membership Relation

Abstract. Two lists are bag equivalent if they are permutations of each other, i.e. if they contain the same elements, with the same multiplicity, but perhaps not in the same order. This paper describes how one can define bag equivalence as the presence of bijections between sets of membership proofs. This definition has some desirable properties: – Many bag equivalences can be proved using a flexible form of equational reasoning. – The definition generalises easily to arbitrary unary containers, including types with infinite values, such as streams. – By using a slight variation of the definition one gets set equivalence instead, i.e. equality up to order and multiplicity. Other variations give the subset and subbag preorders. – The definition works well in mechanised proofs.